New Upper Bounds for the Connective Constants of Self-avoiding Walks
نویسندگان
چکیده
Using a novel implementation of the Goulden-Jackson method, we compute new upper bounds for the connective constants of self-avoiding walks, breaking Alm's previous records for rectangular (hypercubic) lattices. We also give the explicit generating functions for memory 8. The new upper bounds are 2.
منابع مشابه
Improved lower bounds on the connective constants for self-avoiding walks
We calculate improved lower bounds for the connective constants for selfavoiding walks on the square, hexagonal, triangular, (4.8), and (3.12) lattices. The bound is found by Kesten’s method of irreducible bridges. This involves using transfermatrix techniques to exactly enumerate the number of bridges of a given span to very many steps. Upper bounds are obtained from recent exact enumeration d...
متن کاملImproved lower bounds on the connective constants for two-dimensional self-avoiding walks
We calculate improved lower bounds for the connective constants for selfavoiding walks on the square, hexagonal, triangular, (4.82) and (3.122) lattices. The bound is found by Kesten’s method of irreducible bridges. This involves using transfer-matrix techniques to exactly enumerate the number of bridges of a given span to very many steps. Upper bounds are obtained from recent exact enumeration...
متن کاملImproved Upper Bounds for Self-Avoiding Walks in Zd
New upper bounds for the connective constant of self-avoiding walks in a hypercubic lattice are obtained by automatic generation of finite automata for counting walks with finite memory. The upper bound in dimension two is 2.679192495.
متن کاملCounting Self-avoiding Walks
The connective constant μ(G) of a graph G is the asymptotic growth rate of the number of self-avoiding walks on G from a given starting vertex. We survey three aspects of the dependence of the connective constant on the underlying graph G. Firstly, when G is cubic, we study the effect on μ(G) of the Fisher transformation (that is, the replacement of vertices by triangles). Secondly, we discuss ...
متن کاملSelf-avoiding Walks and Connective Constants
The connective constant μ(G) of a quasi-transitive graph G is the asymptotic growth rate of the number of selfavoiding walks (SAWs) on G from a given starting vertex. We survey several aspects of the relationship between the connective constant and the underlying graph G. • We present upper and lower bounds for μ in terms of the vertex-degree and girth of a transitive graph. • We discuss the qu...
متن کامل